import math
class Solution:
def entangled(self, nums):
stack = []
while nums:
x = nums.pop()
if stack:
if stack[-1] == x:
stack.pop()
else:
stack.append(x)
else:
stack.append(x)
if stack:
print("NO")
else:
print("YES")
def main():
sol = Solution()
nums = list(input().strip())
sol.entangled(nums)
if __name__ == '__main__':
main()#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n';
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main()
{
IOS;
int t {1}; //cin >> t;
while(t--)
{
string s; cin >> s;
bool same{1}, ans{1};
stack <char> st;
for(int i = 0; i < s.size(); i++){
if(st.empty()) st.push(s[i]);
else{
if(st.top() == s[i])
st.pop();
else
st.push(s[i]);
}
}
if(!st.empty()) ans = 0;
cout << (ans ? "Yes" : "No") << endl;
}
}881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |